Infinite Buffer Queueing Model with Time-phased Arrivals
نویسنده
چکیده
A single-server queueing model with infinite buffer and batch arrival of customers is considered. In contrast to the standard batch arrival when a whole batch arrives into the system at one epoch, we assume that the customers of an accepted batch arrive one by one in exponentially distributed times. Service time is exponentially distributed. Flow of batches is the stationary Poisson arrival process. Batch size distribution is geometric. The number of batches, which can be admitted into the system simultaneously, is subject of control. The problem of maximizing the throughput of the system under the fixed value of the upper bound for admitted batch average sojourn time is considered. Analysis of the joint distribution of the number of batches and customers in the system and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes.
منابع مشابه
Queueing Models With Finite and Infinite Buffering Capacity
Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obt...
متن کاملLoss probability in a finite discrete-time queue in terms of the steady state distribution of an infinite queue
We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that off-periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a finite...
متن کاملFluid Queues Driven by a Discouraged Arrivals Queue
We consider a fluid queue driven by a discouraged arrivals queue and obtain explicit expressions for the stationary distribution function of the buffer content in terms of confluent hypergeometric functions. We compare it with a fluid queue driven by an infinite server queue. Numerical results are presented to compare the behaviour of the buffer content distributions for both these models. 1. I...
متن کاملA discrete-time priority queue with two-class customers and bulk services
This paper studies the behavior of a discrete queueing system which accepts synchronized arrivals and provides synchronized services. The number of arrivals occurring at an arriving point may follow any arbitrary discrete distribution possessing finite first moment and convergent probability generating function in I z [ ~< 1 + e with e > O. The system is equipped with an infinite buffer and one...
متن کاملQueueing Analysis of a Discrete-Time Multiserver Buffer System with Geometric Service Times
In this paper, a discrete-time multiserver queueing system with infinite buffer size and general independent arrivals is considered. The service times of a packet served by one of the servers are assumed to be independent and identically distributed according to a geometric distribution. Each packet gets service from only one server. In the paper, the behavior of the queueing system is studied ...
متن کامل